Cooperative Multiple Task Assignment Problem With Target Precedence Constraints Using a Waitable Path Coordination and Modified Genetic Algorithm
نویسندگان
چکیده
Task assignment is a critical technology for heterogeneous unmanned aerial vehicle (UAV) applications. Target precedence has typically been ignored in previous studies, such that it possible to obtain task solution with an unreasonable target execution order. For this reason, cooperative multiple problem constraints (CMTAPTPC) model proposed paper, which considers not only kinematic, resource, and of the UAV, but also achieve more realistic scenarios. In addition, graph method improved detect eliminate deadlocks solutions include constraints. We introduced waitable path coordination (WPC) algorithm generate conflict-free flight paths. Unlike traditional elongation method, can reduce number operations save energy UAVs. Based on characteristics CMTAPTPC model, study proposes modified genetic integrates graph-based WPC solve problem. simulation, three problem-scale scenarios were designed, superior performance was demonstrated by comparing algorithm. Finally, time series diagram shows meets all illustrates rationality
منابع مشابه
Locomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملCooperative Task Assignment and Path Planning of Multiple UAVs Using Genetic Algorithm
This paper addresses the task assignment and path planning problem of multiple UAVs. As one of the strategies for a SEAD(Suppressions of Enemy Air Defense) mission, an efficiency strategy for assignment and path planning of homogeneous UAVs is developed. There are many path planning methods (e.g. potential function method or probabilistic roadmap method) to avoid obstacles, but the Voronoi diag...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3063263